Approximating a Sequence of Observation by a Simple Process

نویسندگان

  • Dinah Rosenberg
  • Eilon Solan
  • Nicolas Vieille
چکیده

Given a sequence (s0, s1, . . . , sN ) of observations from a finite set S, we construct a process (sn) that satisfies the following properties: (i) (sn) is a piecewise Markov chain, (ii) the conditional distribution of sn given s0, . . . , sn−1 is close to the empirical transition given by the observed sequence, for most n, (iii) under (sn), with high probability the empirical frequency of the realized sequence is close to the one given by the observed sequence. We generalize this result to the case that the conditional distribution of sn given s0, . . . , sn−1 is required to be in some polyhedron Vsn−1 . ∗Laboratoire d’Analyse Géométrie et Applications, Institut Galilée, Université Paris Nord, avenue Jean-Baptiste Clément, 93430 Villetaneuse, France. e-mail: [email protected] †MEDS Department, Kellogg School of Management, Northwestern University, and the School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel. e-mail: [email protected] ‡Département Finance et Economie, HEC, 1, rue de la Libération, 78 351 Jouy-enJosas, France. e-mail: [email protected] §We thank Ehud Lehrer, Sean Meyn and Laurent Saloff-Coste for their suggestions and references. We acknowledge the financial support of the Arc-en-Ciel/Keshet program for 2001/2002. The research of the second author was supported by the Israel Science Foundation (grant No. 03620191).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating a sequence of observations by a simple process

Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step transitions along a realization from the approximating process, are close to that of the given sequence. We generalize the result to the case where the one-s...

متن کامل

Approximating a Sequence of Observations by a Simple Process1 by Dinah Rosenberg,

Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step transitions along a realization from the approximating process, are close to that of the given sequence. We generalize the result to the case where the one-s...

متن کامل

A Forward-Backward Projection Algorithm for Approximating of the Zero of the ‎S‎um of ‎T‎wo Operators

‎I‎n this paper‎, ‎a‎ forward-‎b‎ackward projection algorithm is considered for finding zero points of the sum of two operators‎ ‎in Hilbert spaces‎. ‎The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly‎ ‎monotone operator and a maximal monotone operator‎. ‎We apply the result for solving the variational inequality problem, fixed po...

متن کامل

Three-component Distillation Columns Sequencing: Including Configurations with Divided-wall Columns

In the present work, the exergy analysis and economic study of 3 different samples of threecomponent mixtures have been investigated (ESI>1, ESI≈1, and ESI<1). The feed mixture has been tested under three different compositions (low, equal, and high contents of the intermediate component). A quantitative comparison between simple and complex configurations, considering thermally coupled, thermo...

متن کامل

A New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming

‎This paper describes a new optimization method for solving continuous semi-infinite linear problems‎. ‎With regard to the dual properties‎, ‎the problem is presented as a measure theoretical optimization problem‎, ‎in which the existence of the solution is guaranteed‎. ‎Then‎, ‎on the basis of the atomic measure properties‎, ‎a computation method was presented for obtaining the near optimal so...

متن کامل

A new one-step iterative process for approximating common fixed points of a countable family of quasi-nonexpansive multi-valued mappings in CAT(0) spaces

‎In this paper‎, ‎we propose a new one-step iterative process for a‎ ‎countable family of quasi-nonexpansive multi-valued mappings in a‎ ‎CAT(0) space‎. ‎We also prove strong and $Delta$-convergence theorems‎ ‎of the proposed iterative process under some control conditions‎. ‎Our‎ ‎main results extend and generalize many results in the literature.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002